An Introduction to Symbolic Trajectory Evaluation
نویسندگان
چکیده
ion Refinement Failed STE assertion “real” counter example something is really wrong “spurious” counter example too many X’s in the simulation After spurious counter example Specification needs to be refined hard to know what kind Pitfall 1 & & OR multiplexer in0
منابع مشابه
Formal Hardware Verification with BDDs: An Introduction
Thispaper is a brief introduction to the main paradigms for using BDDs in formal hardware verification. The paperaddresses two audiences: for people doing theoretical BDD research, the paper gives a glimpse of the problems in the main application area, and for people building hardware, the paper gives a peek under the hood of the formal verification technologies that are rapidly gaining industr...
متن کاملFormal Veriication by Symbolic Evaluation of Partially-ordered Trajectories
Symbolic trajectory evaluation provides a means to formally verify properties of a sequential system by a modiied form of symbolic simulation. The desired system properties are expressed in a notation combining Boolean expressions and the temporal logic \next-time" operator. In its simplest form, each property is expressed as an assertion A =) C], where the antecedent A expresses some assumed c...
متن کاملFormal Veri cation by Symbolic Evaluation of Partially - OrderedTrajectories
Symbolic trajectory evaluation provides a means to formally verify properties of a sequential system by a modiied form of symbolic simulation. The desired system properties are expressed in a notation combining Boolean expressions and the temporal logic \next-time" operator. In its simplest form, each property is expressed as an assertion A =) C], where the antecedent A expresses some assumed c...
متن کاملA New SAT-Based Algorithm for Symbolic Trajectory Evaluation
We present a new SAT-based algorithm for Symbolic Trajectory Evaluation (STE), and compare it to more established SAT-based techniques for STE.
متن کاملSAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation
We present a SAT-based algorithm for assisting users of Symbolic Trajectory Evaluation (STE) in manual abstraction refinement. We demonstrate the usefulness of the algorithm on a larger case study (the verification of a CAM).
متن کامل